Computation of recursive functionals using minimal initial segments
نویسندگان
چکیده
منابع مشابه
Degrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملDefinability of Initial Segments
Let T be a first order theory formulated in the language L and P a new relation symbol not in L. Let φ(P ) be an L ∪ {P}-sentence. Let us say that φ(P ) defines P implicitly in T if T proves φ(P ) ∧ φ(P ) → ∀x(P (x) ↔ P (x)). Beth’s definability theorem states that if φ(P ) defines P implicitlly in T then P (x) is equivalent to an L-formula. However, if we consider implicit definability in a gi...
متن کاملCORDIC: Elementary Function Computation Using Recursive Sequences
Many of us who teach calculus and mathematical topics that use calculus have taken for granted that hand-held calculators use Taylor series or a variant to compute transcendental functions. Thus, it was a surprise to learn that this was not the case. The CORDIC method (Coordinate Rotation Digital Computer) was developed by Jack Volder [6] in the late 1950’s. Hewlett-Packard was quick to realize...
متن کاملCombining Initial Segments of Lists
We propose a new way to build a combined list from K base lists, each containing N items. A combined list consists of top segments of various sizes from each base list so that the total size of all top segments equals N . A sequence of item requests is processed and the goal is to minimize the total number of misses. That is, we seek to build a combined list that contains all the frequently req...
متن کاملOn the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence
It is shown that the length of the algorithmic minimal sufficient statistic of a binary string x, either in a representation of a finite set, computable semimeasure, or a computable function, has a length larger than the computational depth of x, and can solve the Halting problem for all programs with length shorter than the m-depth of x. It is also shown that there are strings for which the al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90036-1